By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 9, Issue 3, pp. 349-509

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Angles of Planar Triangular Graphs

Giuseppe Di Battista and Luca Vismara

pp. 349-359

BibTeX  Abstract Full Text:  PDF

Constrained Embedding Probability for Two Binary Strings

Jovan Dj. Golic

pp. 360-364

BibTeX  Abstract Full Text:  PDF

On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs

E. Andrew Boyd

pp. 365-376

BibTeX  Abstract Full Text:  PDF

Cohen–Macaulay Rings in Network Reliability

Jason I. Brown, Charles J. Colbourn, and David G. Wagner

pp. 377-392

BibTeX  Abstract Full Text:  PDF

Tilings of Binary Spaces

Gerard Cohen, Simon Litsyn, Alexander Vardy, and Gilles Zémor

pp. 393-412

BibTeX  Abstract Full Text:  PDF

Nonequivalent $q$-Ary Perfect Codes

Tuvi Etzion

pp. 413-423

BibTeX  Abstract Full Text:  PDF

Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds

Jürgen Bierbrauer, K. Gopalakrishnan, and D. R. Stinson

pp. 424-452

BibTeX  Abstract Full Text:  PDF

Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks

Robert Connelly and Walter Whiteley

pp. 453-491

BibTeX  Abstract Full Text:  PDF

Approximation Algorithms for the $k$-Clique Covering Problem

Oliver Goldschmidt, Dorit S. Hochbaum, Cor Hurkens, and Gang Yu

pp. 492-509

BibTeX  Abstract Full Text:  PDF